On guaranteed stability of uncertain linear systems via linear control

This paper addresses the problem of stabilizing an uncertain linear system. The uncertaintyq(·) which enters the dynamics is nonstistical in nature. That is, noa priori statistics forq(·) are assumed; only boundsQ on the admissible variations ofq(·) are taken as given. The results given here applied to so-called matched systems differ from previous results in two ways. Firstly, the stabilizing control in this paper is linear; for this same class of problems, many of the existing results would require a nonlinear control. Furthermore, those results which do in fact yield linear controls are only valid when a certain matrix (q) (formed using the given data) is negative definite for allq Q. In contrast, the theory given here only requires compactness of the bounding setQ. Secondly, we show that the so-called matching conditions (used in earlier work) can be generalized so as to encompass a larger class of dynamical systems.This research was supported by the US Department of Energy under Contract No. ET-78-S-01-3390.     

Compehensive two-dimensional gas chromatography (GC×GC) and its applicability to the characterization of complex (petrochemical) mixtures

In general, petrochemical products contain only a limited number of chemical classes of compounds (sample dimensionality). The enormous number of individual components within these classes, however, soon puts limitations upon a single chromatographic technique when it comes to adequate characterization of these products. Comprehensive two-dimensional gas chromatography (GC×GC) clearly opens the possibility of estimating the composition of hydrocarbon mixtures in a far more detailed fashion than hitherto possible. Although the emphasis of papers of GCxGC thus far almost exclusively applies to the unsurpassed peak-capacity, in the oil industry there is a need for characterization, rather than for analyzing all the individual compounds. In principle a GCxGC system can provide an almost perfect match between its intrinsic properties and the dimensionality of oil samples. To establish the applicability of GCxGC towards petrochemical analytical challenges, a commercially aavailable prototype instrument was subjected to an exhaustive characterization of a typical hydrocarbon precess stream and a fast characterization of a light gas oil. Although there are no fundamental limitations towards the quantitative aspects of a GCxGC system, this paper confines itself to qualitative results only. Quantitative aspects of GCxGC will be published in a forthcoming paper.     

Analysis of Petroleum Distillates from Fire Debris Using Supercritical Fluid Extraction with a Two‐Level Orthogonal Array Experimental Design

A supercritical fluid extraction (SFE) method was developed in the present study as an effective sample pretreatment technique of petroleum distillates from fire debris. Three petroleum distillates were used as target analytes, including 95 unleaded gasoline, kerosene, and premium diesel. An orthogonal array (L16) experimental design was adopted to separately evaluate primary SFE experimental factors. The SFE efficiencies of petroleum distillates at various extraction conditions were examined and the optimized SFE conditions were identified. Experimental results demonstrated that the optimized SFE method not only provided an effective extraction method for the spiked sample, but also successfully recovered residues of petroleum distillates from fire debris.     

多对一双方匹配市场中的最优化

在双方市场中定义的博弈概念，可以使市场同方参与者的收益同时达到最大．这种最优化存在的理论依据是选择匹配的稳定性．用博弈论的分析与证明方法研宄多对一双方匹配市场中的最优化．在替代偏好和LAD（Law of Aggregate Demend）偏好下，证明由企业作选择的选择函数一定是个稳定匹配，由工人做选择的选择函数也是一个稳定匹配．     

Erdős matching conjecture for almost perfect matchings

In 1965 Erd?s asked, what is the largest size of a family of k-element subsets of an n-element set that does not contain a matching of size $s+1$? In this note, we improve upon a recent result of Frankl and resolve this problem for $s>101k^3$ and $(s+1)k?n<(s+1)(k+\frac{1}{100k})$.     

运用CAFP教学提升学生化学意志素质的教学案例

鉴于当前学生化学意志素质缺乏的问题，探讨以认知、情绪唤醒、情感、意志为主控目标，在预习、尝试学习、交错搭配合作学习中，开展CAFP教学研究，以促成情意因素对认知的调动、动力、强化等功能。     

Influences of aerodynamic loads on hunting stability of high-speed railway vehicles and parameter studies

The influences of steady aerodynamic loads on hunting stability of high-speed railway vehicles were investigated in this study.A mechanism is suggested to explain the change of hunting behavior due to actions of aerodynamic loads：the aerodynamic loads can change the position of vehicle system（consequently the contact relations）,the wheel/rail normal contact forces,the gravitational restoring forces/moments and the creep forces/moments.A mathematical model for hunting stability incorporating such influences was developed.A computer program capable of incorporating the effects of aerodynamic loads based on the model was written,and the critical speeds were calculated using this program.The dependences of linear and nonlinear critical speeds on suspension parameters considering aerodynamic loads were analyzed by using the orthogonal test method,the results were also compared with the situations without aerodynamic loads.It is shown that the most dominant factors a ff ecting linear and nonlinear critical speeds are different whether the aerodynamic loads considered or not.The damping of yaw damper is the most dominant influencing factor for linear critical speeds,while the damping of lateral damper is most dominant for nonlinear ones.When the influences of aerodynamic loads are considered,the linear critical speeds decrease with the rise of cross wind velocity,whereas it is not the case for the nonlinear critical speeds.The variation trends of critical speeds with suspension parameters can be significantly changed by aerodynamic loads.Combined actions of aerodynamic loads and suspension parameters also a ff ect the critical speeds.The effects of such joint action are more obvious for nonlinear critical speeds.     

Generalized matching theorems for closed coverings of convex sets

In this paper we use fixed point and coincidence theorems due to Park [8] to give matching theorems concerning closed coverings of nonempty convex sets in a real topological vector space. Our new results extend previously given ones due to Ky Fan [2], [3], Shih [10], Shih and Tan [11], and Park [7].     

Gray codes extending quadratic matchings

Is it true that every matching in the n-dimensional hypercube can be extended to a Gray code? More than two decades have passed since Ruskey and Savage asked this question and the problem still remains open. A solution is known only in some special cases, including perfect matchings or matchings of linear size. This article shows that the answer to the Ruskey–Savage problem is affirmative for every matching of size at most . The proof is based on an inductive construction that extends balanced matchings in the completion of the hypercube by edges of into a Hamilton cycle of . On the other hand, we show that for every there is a balanced matching in of size that cannot be extended in this way.